On sequential Monte Carlo, partial rejection control and approximate Bayesian computation

نویسندگان

  • Gareth W. Peters
  • Yanan Fan
  • Scott A. Sisson
چکیده

We present a sequential Monte Carlo sampler variant of the partial rejection control algorithm introduced by Liu (2001), termed SMC sampler PRC, and show that this variant can be considered under the same framework of the sequential Monte Carlo sampler of Del Moral et al. (2006). We make connections with existing algorithms and theoretical results, and extend some theoretical results to the SMC sampler PRC setting. We examine the properties of the SMC sampler PRC and give recommendations for user specified quantities. We also study the special case of SMC sampler PRC in the “likelihood free” approximate Bayesian computation framework, as introduced by Sisson et al. (2007).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive approximate Bayesian computation

Sequential techniques can enhance the efficiency of the approximate Bayesian computation algorithm, as in Sisson et al.’s (2007) partial rejection control version. While this method is based upon the theoretical works of Del Moral et al. (2006), the application to approximate Bayesian computation results in a bias in the approximation to the posterior. An alternative version based on genuine im...

متن کامل

Adaptivity for approximate Bayesian computation algorithms: a population Monte Carlo approach

Sequential techniques can be added to the approximate Bayesian computation (ABC) algorithm to enhance its efficiency. Sisson et al. (2007) introduced the partial rejection control version of this algorithm to improve upon existing Markov chain versions of the algorithm. While Sisson et al.’s (2007) method is based upon the theoretical developments of Del Moral et al. (2006), the application to ...

متن کامل

Sequential Monte Carlo with Adaptive Weights for Approximate Bayesian Computation

Methods of Approximate Bayesian computation (ABC) are increasingly used for analysis of complex models. A major challenge for ABC is over-coming the often inherent problem of high rejection rates in the accept/reject methods based on prior:predictive sampling. A number of recent developments aim to address this with extensions based on sequential Monte Carlo (SMC) strategies. We build on this h...

متن کامل

Approximate Bayesian Computation for Source Term Estimation

Bayesian inference is a vital tool for consistent manipulation of the uncertainty that is present in many military scenarios. However, in some highly complex environments, it is hard to write down an analytic form for the likelihood function that underlies Bayesian inference. Approximate Bayesian computation (ABC) algorithms address this difficulty by enabling one to proceed without analyticall...

متن کامل

Approximate Bayesian Computation for Smoothing

We consider a method for approximate inference in hidden Markov models (HMMs). The method circumvents the need to evaluate conditional densities of observations given the hidden states. It may be considered an instance of Approximate Bayesian Computation (ABC) and it involves the introduction of auxiliary variables valued in the same space as the observations. The quality of the approximation m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Statistics and Computing

دوره 22  شماره 

صفحات  -

تاریخ انتشار 2012